Dynamic problem - PDFSEARCH.IO - Document Search Engine

Dynamic problem
Results: 444

#	Item
141	Optimal Convex Partitions of Point Sets with Few Inner Points Andreas Spillner∗ Abstract We present a fixed-parameter algorithm for the Minimum Convex Partition and the Minimum Weight Convex Partition problem. On a set Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2005-07-31 13:55:54 Mathematical optimization Computational geometry Dynamic programming Equations Systems engineering Algorithm Travelling salesman problem Convex hull Kirkpatrick–Seidel algorithm Operations research Mathematics Applied mathematics
142	Solving a Dynamic Traveling Salesman Problem with an Adaptive Hopfield Network Add to Reading List Source URL: www.complex-systems.com Language: English - Date: 2012-10-10 16:17:59 Applied mathematics Dynamical system Hopfield network Travelling salesman problem Lyapunov stability Lyapunov function Continuous function Mathematics Stability theory Mathematical analysis
143	Microsoft Word - OpPrincAndPF.doc Add to Reading List Source URL: mcs.open.ac.uk Language: English - Date: 2009-10-24 06:02:45 Systems science Problem frames approach Systems analysis Problem solving Communications protocol Complexity Software design Pendulum clock Dynamic programming Science Systems theory Systems engineering
144	The 118th RCKC Colloquium Search Result Diversification via Filling up Multiple Knapsacks Yu Haitao Add to Reading List Source URL: www.tsukuba.ac.jp Language: English - Date: 2014-12-09 20:27:32 Applied mathematics Combinatorial optimization Cryptography Dynamic programming Knapsack problem Mathematical optimization Optimization problem Recommender system Theoretical computer science Computational complexity theory Operations research
145	There is No EPTAS for Two-dimensional Knapsack Ariel Kulik∗ Hadas Shachnai† Abstract Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2010-12-30 12:50:07 Dynamic programming Operations research Complexity classes Approximation algorithms Polynomial-time approximation scheme Knapsack problem Subset sum problem Parameterized complexity Optimization problem Theoretical computer science Computational complexity theory Applied mathematics
146	Some Principles and Ideas of PFA: the Problem Frames Approach (Draft of 30th JanuaryMichael Jackson, The Open University Abstract Add to Reading List Source URL: mcs.open.ac.uk Language: English - Date: 2009-02-01 06:18:16 Problem frames approach Systems analysis Systems science Software design Decomposition Complexity Domain Decomposition method Dynamic programming Systems theory Systems engineering Software development
147	ICS 161 — Algorithms — Spring 2005 — Second Midterm Please answer the following seven questions on the answer sheets provided. Answers written on other pages or on the wrong sheet will not be scored. Be sure to wri Add to Reading List Source URL: www.ics.uci.edu Language: English - Date: 2005-05-26 20:09:03 Operations research Graph theory Mathematical optimization NP-complete problems Network theory Algorithm Shortest path problem Dynamic programming Graph Theoretical computer science Mathematics Applied mathematics
148	An Approximate Dynamic Programming Approach to a Communication Constrained Sensor Management Problem ∗ Laboratory Jason L. Williams,∗ John W. Fisher III† and Alan S. Willsky∗ Add to Reading List Source URL: ssg.mit.edu Language: English - Date: 2012-02-01 13:45:48 Mathematics Wireless sensor network Kalman filter Robot control Subgradient method Sensor node Entropy Sensor Lagrange multiplier Technology Graph theory Mathematical optimization
149	CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008 Exact Pareto-Optimal Coordination of Two Translating Polygonal Robots on a Cyclic Roadmap Hamidreza Chitsaz∗ Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-29 00:00:23 Theoretical computer science Mathematical optimization Network theory Operations research Motion planning Shortest path problem Visibility graph Dynamic programming Pareto efficiency Mathematics Applied mathematics Graph theory
150	Improved Parameterized Algorithms for Network Query Problems Ron Y. Pinter, Hadas Shachnai, and Meirav Zehavi Department of Computer Science, Technion, Haifa 32000, Israel {pinter,hadas,meizeh}@cs.technion.ac.il Abstract Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2014-03-05 14:37:49 Complexity classes NP-complete problems Parameterized complexity Tree decomposition Dynamic programming NP-hard NP Clique problem Theoretical computer science Computational complexity theory Graph theory

UPDATE